Solving Stochastic Nonlinear Resource Allocation Problems Using a Hierarchy of Twofold Resource Allocation Automata
نویسندگان
چکیده
منابع مشابه
Nonlinear Equilibrium for Resource Allocation Problems
We consider Nonlinear Equilibrium (NE) for the optimal allocation of limited resources. The NE is a generalization of Walras-Wald equilibrium, which is equivalent to J. Nash equilibrium in n-person concave games. Finding NE is equivalent to solving a variational inequality (VI) with a monotone and smooth operator on Ω = R+ ⊗ R+ . Projection on Ω is a very simple procedure; therefore, our main f...
متن کاملOnline Resource Allocation Problems∗
In this paper, we consider an online resource allocation problem, where buyers with limited budgets are interested in purchasing items that consume a limited amount of resources. In general, there is no nontrivial performance guarantee for the worst cases. However, after imposing two reasonable restrictions, we can propose two online algorithms, a greedy algorithm and a primal dual algorithm, w...
متن کاملResource Allocation Under Stochastic Demands
Military theater settings may involve many competing missions whose whose requirements tax the coalition’s resources in multiple dimensions—i.e., requiring different amounts of many different kinds of resources, e.g., fuel, bandwidth, personnel, etc., each of which is available in limited supply— and in uncertain or stochastic amounts. To serve the overall mission, we need to satisfy resource r...
متن کاملA stochastic algorithm for online bipartite resource allocation problems
This paper deals with online resource allocation problems whereby buyers with a limited total budget want to purchase items that become available one at a time and which consume some amount of various limited resources upon allocation. Sponsored search advertising is a typical example: in order to maximize revenue, search engines try to choose the best available advertisement to display for eac...
متن کاملSolving Resource Allocation/Scheduling Problems with Constraint Integer Programming
Constraint Integer Programming (CIP) is a generalization of mixed-integer programming (MIP) in the direction of constraint programming (CP) allowing the inference techniques that have traditionally been the core of CP to be integrated with the problem solving techniques that form the core of complete MIP solvers. In this paper, we investigate the application of CIP to scheduling problems that r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2010
ISSN: 0018-9340
DOI: 10.1109/tc.2009.189